#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

char get_mid_member(char first, char second, char last)
{
    if (first > second) {
    	first  = first ^ second;
    	second = first ^ second;
		first  = first ^ second; 
    }	
    if (last < second) {
    	last = last ^ second;
    	second = last ^ second;
    	last = last ^ second;
    }
    
    return second;
}


char * quick_sort(char * array, int number)
{
    int first = 0, last = number-1;
	int mid = get_mid_member(array[0], array[number/2], array[number-1]);
		
}